Probabilistic Planning in the Graphplan Framework
نویسندگان
چکیده
The Graphplan planner has enjoyed considerable success as a planning algorithm for classical STRIPS domains In this paper we explore the extent to which its representation can be used for probabilistic planning In particular we consider an MDP style framework in which the state of the world is known but actions are probabilistic and the objective is to produce a nite horizon contingent plan with highest probability of success within the horizon We describe two extensions of Graphplan in this direction The rst PGraphplan produces an optimal contingent plan It typically su ers a performance hit compared to Graphplan but still appears to be fast com pared with other approaches to probabilistic planning problems The second TGraphplan runs at essentially the same speed as Graphplan but produces potentially sub optimal policies TGraphplan s policy selects the rst action on the highest probability trajectory from its current state to the goal Ideally we would like an optimal planner for probabilistic domains with the same speed that Graphplan would have if the domain were made deterministic By comparing the speed and quality of these two planners to each other and to other existing planners we are able to estimate how far o we are from our ideal PGraphplan is based on a forward chaining search unlike the backward chaining search of the standard Graphplan algorithm Thus one focus of this paper is exploring the extent to which Graphplan s representation can be used to speed up forward search in addition to the backward search for which it was originally intended
منابع مشابه
Concurrent Probabilistic Planning in the Graphplan Framework
We consider the problem of planning optimally in potentially concurrent probabilistic domains: actions have probabilistic effects and may execute in parallel under certain conditions; we seek a contingency plan that maximises the probability of reaching the goal. The Graphplan framework has proven to be highly successful at solving classical planning problems, but has not previously been applie...
متن کاملTowards Efficient Probabilistic Temporal Planning
Many real-world planning problems involve a combination of both time and uncertainty (Bresina et al. 2002). For instance, Aberdeen et al. (2004) investigate military operations planning problems that feature concurrent durative actions, probabilistic timed effects, resource consumption, and competing cost measures. It is the potential for such practical applications that motivates this research...
متن کاملCreating or Destroying Objects Plan in the Graphplan Framework
At present, intelligent planning in the Graphplan framework is a focus of artificial intelligence. While the Creating or Destroying Objects Planning (CDOP) is one unsolved problem of this field, one of the difficulties, too. In this paper, we study this planning problem and bring forward the idea of transforming objects to propositions, based on which we offer an algorithm, Creating or Destroyi...
متن کاملDecision-Theoretic Planning in the Graphplan Framework
We have developed a decision-theoretic planner based upon the Graphplan planning algorithm, DT-Graphplan. DT-Graphplan reasons about probabilities, costs, and rewards at a propositional level, reconstructing limited state information. We are applying the planner to our robot task architecture to function on a miniature golf domain. By incorporating decision theory into planning, we seek to redu...
متن کاملConformant Graphplan
Planning under uncertainty is a difficult task. If sensory information is available, it is possible to do contingency planning – that is, develop plans where certain branches are executed conditionally, based on the outcome of sensory actions. However, even without sensory information, it is often possible to develop useful plans that succeed no matter which of the allowed states the world is a...
متن کامل